A loss minimization control method for IPMSM drive system based on improved gradient descent algorithm

نویسندگان

چکیده

This paper proposes a loss minimization control method based on improved gradient descent algorithm (GDA) for interior permanent magnet synchronous machine (IPMSM). Since the power of PMSM is derived from measured phase voltage and current, this independent iron model containing motor parameters. Meanwhile, it can guarantee stability system when entering searching period. Both maximum torque per ampere (MTPA) id=0 are carried out to validate effectiveness proposed method. The experimental results demonstrated verify approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis Of IPMSM Drive Using Fuzzy Logic Controller Based Loss Minimization Algorithm (LMA)

This project presents an online lossminimization algorithm (LMA) for a fuzzy-logiccontroller (FLC)-based interior permanent-magnet synchronous-motor (IPMSM) drive to yield high efficiency and high dynamic performance over a wide speed range. LMA is developed based on the motor model. In order to minimize the controllable electrical losses of the motor and thereby maximize the operating efficien...

متن کامل

Improved Stochastic gradient descent algorithm for SVM

In order to improve the efficiency and classification ability of Support vector machines (SVM) based on stochastic gradient descent algorithm, three algorithms of improved stochastic gradient descent (SGD) are used to solve support vector machine, which are Momentum, Nesterov accelerated gradient (NAG), RMSprop. The experimental results show that the algorithm based on RMSprop for solving the l...

متن کامل

A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization

This paper presents a coordinate gradient descent approach for minimizing the sum of a smooth function and a nonseparable convex function. We find a search direction by solving a subproblem obtained by a second-order approximation of the smooth function and adding a separable convex function. Under a local Lipschitzian error bound assumption, we show that the algorithm possesses global and loca...

متن کامل

A coordinate gradient descent method for ℓ1-regularized convex minimization

In applications such as signal processing and statistics, many problems involve finding sparse solutions to under-determined linear systems of equations. These problems can be formulated as a structured nonsmooth optimization problems, i.e., the problem of minimizing `1-regularized linear least squares problems. In this paper, we propose a block coordinate gradient descent method (abbreviated a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Electronics Express

سال: 2022

ISSN: ['1349-2543', '1349-9467']

DOI: https://doi.org/10.1587/elex.19.20220069